منابع مشابه
Finding Neighbors in Images Represented By Quadtree
In this paper, we propose an algorithm for neighbors finding in images represented by quadtree data structure. We first present a scheme for addressing image pixels that takes into account the order defined on a quadtree blocks. We study various properties of this method, and then we develop a formula that establishes links between quadtree blocks. Based on these results, we present an efficien...
متن کاملBacterial division: Finding the dividing line
Division of a cell - whether eukaryotic or prokaryotic - requires accurate spatial coordination. Recent work on the bacterium Escherichia coli has shown that correct placement of the cell division site at the midcell position occurs by a combination of selection against potential polar sites and selection of the midcell site.
متن کاملFinding Data Broadness Via Generalized Nearest Neighbors
A data object is broad if it is one of the k-Nearest Neighbors (k-NN) of many data objects. We introduce a new database primitive called Generalized Nearest Neighbor (GNN) to express data broadness. We also develop three strategies to answer GNN queries efficiently for large datasets of multidimensional objects. The R*-Tree based search algorithm generates candidate pages and ranks them based o...
متن کاملLocality-Sensitive Hashing for Finding Nearest Neighbors
1053-5888/08/$20.00©2008IEEE IEEE SIGNAL PROCESSING MAGAZINE [128] MARCH 2008 T he Internet has brought us a wealth of data, all now available at our fingertips. We can easily carry in our pockets thousands of songs, hundreds of thousands of images, and hundreds of hours of video. But even with the rapid growth of computer performance, we don’t have the processing power to search this amount of...
متن کاملIterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest neighbors to each point. We argue that this is better in a number of ways than previous algorithms, which were based on high order Voronoi diagrams. Our technique allows us for the rst time to e ciently maintain minima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2016
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.aad8688